The minimal spanning tree and the upper box dimension

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Minimal Spanning Tree and the Upper Box Dimension

We show that the α-weight of an MST over n points in a metric space with upper box dimension d has a bound independent of n if α > d and does not have one if α < d.

متن کامل

Persistent Homology and the Upper Box Dimension

We introduce a fractal dimension for a metric space based on the persistent homology of subsets of that space. We exhibit hypotheses under which this dimension is comparable to the upper box dimension; in particular, the dimensions coincide for subsets of R whose upper box dimension exceeds 1.5.

متن کامل

On the bicriterion - minimal cost/minimal label - spanning tree problem

We deal with a bicriterion spanning tree problem relevant in some application fields such as telecommunication networks or electric networks. Each edge is assigned with a cost value and a label (such as a color). The first criterion intends to minimize the total cost of the spanning tree (the summation of its edge costs), while the second intends to get the solution with a minimum number of dif...

متن کامل

The 2-dimension of a Tree

Let $x$ and $y$ be two distinct vertices in a connected graph $G$. The $x,y$-location of a vertex $w$ is the ordered pair of distances from $w$ to $x$ and $y$, that is, the ordered pair $(d(x,w), d(y,w))$. A set of vertices $W$ in $G$ is $x,y$-located if any two vertices in $W$ have distinct $x,y$-location.A set $W$ of vertices in $G$ is 2-located if it is $x,y$-located, for some distinct...

متن کامل

Uniformity Testing Using Minimal Spanning Tree

Testing for uniformity of multivariate data is the initial step in exploratory pattern analysis. We propose a new uniformity testing method, which first computes the maximum (standardized) edge length in the MST of the given data. Large lengths indicate the existence of well-separated clusters or outliers in the data. For the data passing this edge inconsistency test, we generate two sub-sample...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the American Mathematical Society

سال: 2005

ISSN: 0002-9939,1088-6826

DOI: 10.1090/s0002-9939-05-08061-5